package org.leetcode.easy.leetcode617;

import org.leetcode.TreeNode;

public class Solution
{
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2)
    {
        if (root1==null && root2==null)
        {
            return null;
        }

        TreeNode node = new TreeNode();

        if (root1==null)
        {
            return root2;
        }


        if (root2==null)
        {
            return root1;
        }

        if (root1!=null && root2!=null)
        {
            node.val=root1.val+ root2.val;
        }

        node.left=mergeTrees(root1.left,root2.left);
        node.right=mergeTrees(root1.right,root2.right);

        return node;
    }
}
